Bit interleaver for low-density parity check codeword having length of 64800 and code rate of 5/15 and 4096-symbol mapping, and bit interleaving method using same

ABSTRACT

A bit interleaver, a bit-interleaved coded modulation (BICM) device and a bit interleaving method are disclosed herein. The bit interleaver includes a first memory, a processor, and a second memory. The first memory stores a low-density parity check (LDPC) codeword having a length of 64800 and a code rate of 5/15. The processor generates an interleaved codeword by interleaving the LDPC codeword on a bit group basis. The size of the bit group corresponds to a parallel factor of the LDPC codeword. The second memory provides the interleaved codeword to a modulator for 4096-symbol mapping.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 14/671,576, filed Mar. 27, 2015, which claims the benefit of Korean Patent Application Nos. 10-2014-0036153 and 10-2015-0023417, filed Mar. 27, 2014 and Feb. 16, 2015, respectively, which are hereby incorporated by reference herein in their entirety.

BACKGROUND 1. Technical Field

The present disclosure relates generally to an interleaver and, more particularly, to a bit interleaver that is capable of distributing burst errors occurring in a digital broadcast channel.

2. Description of the Related Art

Bit-Interleaved Coded Modulation (BICM) is bandwidth-efficient transmission technology, and is implemented in such a manner that an error-correction coder, a bit-by-bit interleaver and a high-order modulator are combined with one another.

BICM can provide excellent performance using a simple structure because it uses a low-density parity check (LDPC) coder or a Turbo coder as the error-correction coder. Furthermore, BICM can provide high-level flexibility because it can select modulation order and the length and code rate of an error correction code in various forms. Due to these advantages, BICM has been used in broadcasting standards, such as DVB-T2 and DVB-NGH, and has a strong possibility of being used in other next-generation broadcasting systems.

However, in spite of those advantages, BICM suffers from the rapid degradation of performance unless burst errors occurring in a channel are appropriately distributed via the bit-by-bit interleaver. Accordingly, the bit-by-bit interleaver used in BICM should be designed to be optimized for the modulation order or the length and code rate of the error correction code.

SUMMARY

At least one embodiment of the present invention is directed to the provision of an intra-BICM bit interleaver that can effectively distribute burst errors occurring in a broadcasting system channel.

At least one embodiment of the present invention is directed to the provision of a bit interleaver that is optimized for an LDPC coder having a length of 64800 and a code rate of 5/15 and a modulator performing 4096-symbol mapping and, thus, can be applied to next-generation broadcasting systems, such as ATSC 3.0.

In accordance with an aspect of the present invention, there is provided a bit interleaver, including a first memory configured to store a low-density parity check (LDPC) codeword having a length of 64800 and a code rate of 5/15; a processor configured to generate an interleaved codeword by interleaving the LDPC codeword on a bit group basis, the size of the bit group corresponding to a parallel factor of the LDPC codeword; and a second memory configured to provide the interleaved codeword to a modulator for 4096-symbol mapping.

The 4096-symbol mapping may be NUC (Non-Uniform Constellation) symbol mapping corresponding to 4096 constellations (symbols).

The parallel factor may be 360, and each of the bit groups may include 360 bits.

The LDPC codeword may be represented by (u₀, u₁, . . . , u_(N) _(ldpc) −1) (where N_(ldpc) is 64800), and may be divided into 180 bit groups each including 360 bits, as in the following equation:

X _(j) ={u _(k)|360×j≤k<360×(j+1), 0≤k<N _(ldpc)} for 0≤j<N _(group)

where X_(j) is an j-th bit group, N_(ldpc) is 64800, and N_(group) is 180.

The interleaving may be performed using the following equation using permutation order:

Y _(j) =X _(π(j)) 0≤j≤N _(group)

where X_(j) is the j-th bit group, Y_(j) is an interleaved j-th bit group, and π(j) is a permutation order for bit group-based interleaving (bit group-unit interleaving).

The permutation order may correspond to an interleaving sequence represented by the following equation:

interleaving sequence={146 89 57 16 164 138 91 78 90 66 122 12 9 157 14 68 112 128 74 45 28 87 158 56 61 168 18 161 95 99 139 22 65 130 166 118 150 49 142 44 36 1 121 6 46 29 88 47 0 58 105 43 80 64 107 21 55 151 8 145 163 7 98 123 17 11 153 136 52 3 13 34 160 102 125 114 152 84 32 97 33 60 62 79 37 129 38 165 71 75 59 144 127 132 104 53 162 103 120 54 155 116 48 77 76 73 113 119 179 177 41 19 92 109 31 143 178 108 39 140 106 40 5 25 81 176 101 124 126 72 111 4 173 156 134 86 174 2 170 35 175 137 15 24 69 96 30 117 67 171 149 169 63 23 20 167 27 147 51 10 82 131 85 110 94 135 172 148 50 154 42 70 115 26 83 141 100 133 93 159}

In accordance with another aspect of the present invention, there is provided a bit interleaving method, including storing an LDPC codeword having a length of 64800 and a code rate of 5/15; generating an interleaved codeword by interleaving the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword; and outputting the interleaved codeword to a modulator for 4096-symbol mapping.

In accordance with still another aspect of the present invention, there is provided a BICM device, including an error-correction coder configured to output an LDPC codeword having a length of 64800 and a code rate of 5/15; a bit interleaver configured to interleave the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword and output the interleaved codeword; and a modulator configured to perform 4096-symbol mapping on the interleaved codeword.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects, features and advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:

FIG. 1 is a block diagram illustrating a broadcast signal transmission and reception system according to an embodiment of the present invention;

FIG. 2 is an operation flowchart illustrating a broadcast signal transmission and reception method according to an embodiment of the present invention;

FIG. 3 is a diagram illustrating the structure of a parity check matrix (PCM) corresponding to an LDPC code to according to an embodiment of the present invention;

FIG. 4 is a diagram illustrating the bit groups of an LDPC codeword having a length of 64800;

FIG. 5 is a diagram illustrating the bit groups of an LDPC codeword having a length of 16200;

FIG. 6 is a diagram illustrating interleaving that is performed on a bit group basis in accordance with an interleaving sequence;

FIG. 7 is a block diagram illustrating a bit interleaver according to an embodiment of the present invention; and

FIG. 8 is an operation flowchart illustrating a bit interleaving method according to an embodiment of the present invention.

DETAILED DESCRIPTION

Embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Repeated descriptions and descriptions of well-known functions and configurations that have been deemed to make the gist of the present invention unnecessarily obscure will be omitted below. The embodiments of the present invention are intended to fully describe the present invention to persons having ordinary knowledge in the art to which the present invention pertains. Accordingly, the shapes, sizes, etc. of components in the drawings may be exaggerated to make the description obvious.

Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

FIG. 1 is a block diagram illustrating a broadcast signal transmission and reception system according to an embodiment of the present invention.

Referring to FIG. 1, it can be seen that a BICM device 10 and a BICM reception device 30 communicate with each other over a wireless channel 20.

The BICM device 10 generates an n-bit codeword by encoding k information bits 11 using an error-correction coder 13. In this case, the error-correction coder 13 may be an LDPC coder or a Turbo coder.

The codeword is interleaved by a bit interleaver 14, and thus the interleaved codeword is generated.

In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group). In this case, the error-correction coder 13 may be an LDPC coder having a length of 64800 and a code rate of 5/15. A codeword having a length of 64800 may be divided into a total of 180 bit groups. Each of the bit groups may include 360 bits, i.e., the parallel factor of an LDPC codeword.

In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group) in accordance with an interleaving sequence, which will be described later.

In this case, the bit interleaver 14 prevents the performance of error correction code from being degraded by effectively distributing burst errors occurring in a channel. In this case, the bit interleaver 14 may be separately designed in accordance with the length and code rate of the error correction code and the modulation order.

The interleaved codeword is modulated by a modulator 15, and is then transmitted via an antenna 17.

In this case, the modulator 15 may be based on a concept including symbol mapper (symbol mapping device). In this case, the modulator 15 may be a symbol mapping device performing 4096-symbol mapping which maps codes onto 4096 constellations (symbols).

In this case, the modulator 15 may be a uniform modulator, such as a quadrature amplitude modulation (QAM) modulator, or a non-uniform modulator.

The modulator 15 may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping which uses 4096 constellations (symbols).

The signal transmitted via the wireless channel 20 is received via the antenna 31 of the BICM reception device 30, and, in the BICM reception device 30, is subjected to a process reverse to the process in the BICM device 10. That is, the received data is demodulated by a demodulator 33, is deinterleaved by a bit deinterleaver 34, and is then decoded by an error correction decoder 35, thereby finally restoring the information bits.

It will be apparent to those skilled in the art that the above-described transmission and reception processes have been described within a minimum range required for a description of the features of the present invention and various processes required for data transmission may be added.

FIG. 2 is an operation flowchart illustrating a broadcast signal transmission and reception method according to an embodiment of the present invention.

Referring to FIG. 2, in the broadcast signal transmission and reception method according to this embodiment of the present invention, input bits (information bits) are subjected to error-correction coding at step S210.

That is, at step S210, an n-bit codeword is generated by encoding k information bits using the error-correction coder.

In this case, step S210 may be performed as in an LDPC encoding method, which will be described later.

Furthermore, in the broadcast signal transmission and reception method, an interleaved codeword is generated by interleaving the n-bit codeword on a bit group basis at step S220.

In this case, the n-bit codeword may be an LDPC codeword having a length of 64800 and a code rate of 5/15. The codeword having a length of 64800 may be divided into a total of 180 bit groups. Each of the bit groups may include 360 bits corresponding to the parallel factors of an LDPC codeword.

In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group) in accordance with an interleaving sequence, which will be described later.

Furthermore, in the broadcast signal transmission and reception method, the encoded data is modulated at step S230.

That is, at step S230, the interleaved codeword is modulated using the modulator.

In this case, the modulator may be based on a concept including symbol mapper (symbol mapping device). In this case, the modulator may be a symbol mapping device performing 4096-symbol mapping which maps codes onto 4096 constellations (symbols).

In this case, the modulator may be a uniform modulator, such as a QAM modulator, or a non-uniform modulator.

The modulator may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping which uses 4096 constellations (symbols).

Furthermore, in the broadcast signal transmission and reception method, the modulated data is transmitted at step S240.

That is, at step S240, the modulated codeword is transmitted over the wireless channel via the antenna.

Furthermore, in the broadcast signal transmission and reception method, the received data is demodulated at step S250.

That is, at step S250, the signal transmitted over the wireless channel is received via the antenna of the receiver, and the received data is demodulated using the demodulator.

Furthermore, in the broadcast signal transmission and reception method, the demodulated data is deinterleaved at step S260. In this case, the deinterleaving of step S260 may be reverse to the operation of step S220.

Furthermore, in the broadcast signal transmission and reception method, the deinterleaved codeword is subjected to error correction decoding at step S270.

That is, at step S270, the information bits are finally restored by performing error correction decoding using the error correction decoder of the receiver.

In this case, step S270 corresponds to a process reverse to that of an LDPC encoding method, which will be described later.

An LDPC code is known as a code very close to the Shannon limit for an additive white Gaussian noise (AWGN) channel, and has the advantages of asymptotically excellent performance and parallelizable decoding compared to a turbo code.

Generally, an LDPC code is defined by a low-density parity check matrix (PCM) that is randomly generated. However, a randomly generated LDPC code requires a large amount of memory to store a PCM, and requires a lot of time to access memory. In order to overcome these problems, a quasi-cyclic LDPC (QC-LDPC) code has been proposed. A QC-LDPC code that is composed of a zero matrix or a circulant permutation matrix (CPM) is defined by a PCM that is expressed by the following Equation 1:

$\begin{matrix} {{H = \begin{bmatrix} J^{a_{11}} & J^{a_{12}} & \ldots & J^{a_{1n}} \\ J^{a_{21}} & J^{a_{22}} & \ldots & J^{a_{2n}} \\ \vdots & \vdots & \ddots & \vdots \\ J^{a_{m\; 1}} & J^{a_{m\; 2}} & \ldots & J^{a_{mn}} \end{bmatrix}},{{{for}\mspace{14mu} a_{ij}} \in \left\{ {0,1,\ldots \;,{L - 1},\infty} \right\}}} & (1) \end{matrix}$

In this equation, J is a CPM having a size of L×L, and is given as the following Equation 2. In the following description, L may be 360.

$\begin{matrix} {J_{L \times L} = \begin{bmatrix} 0 & 1 & 0 & \ldots & 0 \\ 0 & 0 & 1 & \ldots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \ldots & 1 \\ 1 & 0 & 0 & \ldots & 0 \end{bmatrix}} & (2) \end{matrix}$

Furthermore, J^(i) is obtained by shifting an L×L identity matrix I (J⁰) to the right i (0≤i<L) times, and J^(∞) is an L×L zero matrix. Accordingly, in the case of a QC-LDPC code, it is sufficient if only index exponent i is stored in order to store J^(i), and thus the amount of memory required to store a PCM is considerably reduced.

FIG. 3 is a diagram illustrating the structure of a PCM corresponding to an LDPC code to according to an embodiment of the present invention.

Referring to FIG. 3, the sizes of matrices A and C are g×K and (N−K−g)×(K+g), respectively, and are composed of an L×L zero matrix and a CPM, respectively. Furthermore, matrix Z is a zero matrix having a size of g×(N−K−g), matrix D is an identity matrix having a size of (N−K−g)×(N−K−g), and matrix B is a dual diagonal matrix having a size of g×g. In this case, the matrix B may be a matrix in which all elements except elements along a diagonal line and neighboring elements below the diagonal line are 0, and may be defined as the following Equation 3:

$\begin{matrix} {B_{g \times g} = \begin{bmatrix} I_{L \times L} & 0 & 0 & \ldots & 0 & 0 & 0 \\ I_{L \times L} & I_{L \times L} & 0 & \ldots & 0 & 0 & 0 \\ 0 & I_{L \times L} & I_{L \times L} & \vdots & 0 & 0 & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & \ldots & I_{L \times L} & I_{L \times L} & 0 \\ 0 & 0 & 0 & \ldots & 0 & I_{L \times L} & I_{L \times L} \end{bmatrix}} & (3) \end{matrix}$

where I_(L×L) is an identity matrix having a size of L×L.

That is, the matrix B may be a bit-wise dual diagonal matrix, or may be a block-wise dual diagonal matrix having identity matrices as its blocks, as indicated by Equation 3. The bit-wise dual diagonal matrix is disclosed in detail in Korean Patent Application Publication No. 2007-0058438, etc.

In particular, it will be apparent to those skilled in the art that when the matrix B is a bit-wise dual diagonal matrix, it is possible to perform conversion into a Quasi-cyclic form by applying row or column permutation to a PCM including the matrix B and having a structure illustrated in FIG. 3.

In this case, N is the length of a codeword, and K is the length of information.

The present invention proposes a newly designed QC-LDPC code in which the code rate thereof is 5/15 and the length of a codeword is 64800, as illustrated in the following Table 1. That is, the present invention proposes an LDPC code that is designed to receive information having a length of 21600 and generate an LDPC codeword having a length of 64800.

Table 1 illustrates the sizes of the matrices A, B, C, D and Z of the QC-LDPC code according to the present invention:

TABLE 1 Sizes Code rate Length A B C D Z 5/15 64800 1440 × 21600 1440 × 1440 41760 × 23040 41760 × 41760 1080 × 41760

The newly designed LDPC code may be represented in the form of a sequence (progression), an equivalent relationship is established between the sequence and matrix (parity bit check matrix), and the sequence may be represented, as follows:

Sequence Table 1st row: 221 1011 1218 4299 7143 8728 11072 15533 17356 33909 36833 2nd row: 360 1210 1375 2313 3493 16822 21373 23588 23656 26267 34098 3rd row: 544 1347 1433 2457 9186 10945 13583 14858 19195 34606 37441 4th row: 37 596 715 4134 8091 12106 24307 24658 34108 40591 42883 5th row: 235 398 1204 2075 6742 11670 13512 23231 24784 27915 34752 6th row: 204 873 890 13550 16570 19774 34012 35249 37655 39885 42890 7th row: 221 371 514 11984 14972 15690 28827 29069 30531 31018 43121 8th row: 280 549 1435 1889 3310 10234 11575 15243 20748 30469 36005 9th row: 223 666 1248 13304 14433 14732 18943 21248 23127 38529 39272 10th row: 370 819 1065 9461 10319 25294 31958 33542 37458 39681 40039 11st row: 585 870 1028 5087 5216 12228 16216 16381 16937 27132 27893 12nd row: 164 167 1210 7386 11151 20413 22713 23134 24188 36771 38992 13rd row: 298 511 809 4620 7347 8873 19602 24162 29198 34304 41145 14th row: 105 830 1212 2415 14759 15440 16361 16748 22123 32684 42575 15th row: 659 665 668 6458 22130 25972 30697 31074 32048 36078 37129 16th row: 91 808 953 8015 8988 13492 13987 15979 28355 34509 39698 17th row: 594 983 1265 3028 4029 9366 11069 11512 27066 40939 41639 18th row: 506 740 1321 1484 10747 16376 17384 20285 31502 38925 42606 19th row: 338 356 975 2022 3578 18689 18772 19826 22914 24733 27431 20th row: 709 1264 1366 4617 8893 25226 27800 29080 30277 37781 39644 21st row: 840 1179 1338 2973 3541 7043 12712 15005 17149 19910 36795 22nd row: 1009 1267 1380 4919 12679 22889 29638 30987 34637 36232 37284 23rd row: 466 913 1247 1646 3049 5924 9014 20539 34546 35029 36540 24th row: 374 697 984 1654 5870 10883 11684 20294 28888 31612 34031 25th row: 117 240 635 5093 8673 11323 12456 14145 21397 39619 42559 26th row: 122 1265 1427 13528 14282 15241 16852 17227 34723 36836 39791 27th row: 595 1180 1310 6952 17916 24725 24971 27243 29555 32138 35987 28th row: 140 470 1017 13222 13253 18462 20806 21117 28673 31598 37235 29th row: 7 710 1072 8014 10804 13303 14292 16690 26676 36443 41966 30th row: 48 189 759 12438 14523 16388 23178 27315 28656 29111 29694 31st row: 285 387 410 4294 4467 5949 25386 27898 34880 41169 42614 32nd row: 474 545 1320 10506 13186 18126 27110 31498 35353 36193 37322 33rd row: 1075 1130 1424 11390 13312 14161 16927 25071 25844 34287 38151 34th row: 161 396 427 5944 17281 22201 25218 30143 35566 38261 42513 35th row: 233 247 694 1446 3180 3507 9069 20764 21940 33422 39358 36th row: 271 508 1013 6271 21760 21858 24887 29808 31099 35475 39924 37th row: 8 674 1329 3135 5110 14460 28108 28388 31043 31137 31863 38th row: 1035 1222 1409 8287 16083 24450 24888 29356 30329 37834 39684 39th row: 391 1090 1128 1866 4095 10643 13121 14499 20056 22195 30593 40th row: 55 161 1402 6289 6837 8791 17937 21425 26602 30461 37241 41st row: 110 377 1228 6875 13253 17032 19008 23274 32285 33452 41630 42nd row: 360 638 1355 5933 12593 13533 23377 23881 24586 26040 41663 43rd row: 535 1240 1333 3354 10860 16032 32573 34908 34957 39255 40759 44th row: 526 936 1321 7992 10260 18527 28248 29356 32636 34666 35552 45th row: 336 785 875 7530 13062 13075 18925 27963 28703 33688 36502 46th row: 36 591 1062 1518 3821 7048 11197 17781 19408 22731 24783 47th row: 214 1145 1223 1546 9475 11170 16061 21273 38688 40051 42479 48th row: 1136 1226 1423 20227 22573 24951 26462 29586 34915 42441 43048 49th row: 26 276 1425 6048 7224 7917 8747 27559 28515 35002 37649 50th row: 127 294 437 4029 8585 9647 11904 24115 28514 36893 39722 51st row: 748 1093 1403 9536 19305 20468 31049 38667 40502 40720 41949 52nd row: 96 638 743 9806 12101 17751 22732 24937 32007 32594 38504 53rd row: 649 904 1079 2770 3337 9158 20125 24619 32921 33698 35173 54th row: 401 518 984 7372 12438 12582 18704 35874 39420 39503 39790 55th row: 10 451 1077 8078 16320 17409 25807 28814 30613 41261 42955 56th row: 405 592 1178 15936 18418 19585 21966 24219 30637 34536 37838 57th row: 50 584 851 9720 11919 22544 22545 25851 35567 41587 41876 58th row: 911 1113 1176 1806 10058 10809 14220 19044 20748 29424 36671 59th row: 441 550 1135 1956 11254 18699 30249 33099 34587 35243 39952 60th row: 510 1016 1281 8621 13467 13780 15170 16289 20925 26426 34479 61st row: 4969 5223 17117 21950 22144 24043 27151 39809 62nd row: 11452 13622 18918 19670 23995 32647 37200 37399 63rd row: 6351 6426 13185 13973 16699 22524 31070 31916 64th row: 4098 10617 14854 18004 28580 36158 37500 38552

An LDPC code that is represented in the form of a sequence is being widely used in the DVB standard.

According to an embodiment of the present invention, an LDPC code presented in the form of a sequence is encoded, as follows. It is assumed that there is an information block S=(s₀,s₁, . . . , s_(K−1)) having an information size K. The LDPC encoder generates a codeword Λ=(λ₀, λ₁, λ₂, . . . , λ_(N−1)) having a size of N=K+M₁+M₂ using the information block S having a size K. In this case, M₁=g, and M₂=N−K−g. Furthermore, M₁ is the size of parity bits corresponding to the dual diagonal matrix B, and M₂ is the size of parity bits corresponding to the identity matrix D. The encoding process is performed, as follows:

Initialization:

λ_(i)=s_(i) for i=0,1, . . . , K−1

p _(j)=0 for j=0,1, . . . , M ₁ +M ₂−1   (4)

First information bit λ₀ is accumulated at parity bit addresses specified in the 1st row of the sequence of the Sequence Table. For example, in an LDPC code having a length of 64800 and a code rate of 5/15, an accumulation process is as follows:

p₂₂₁ = p₂₂₁ ⊕ λ₀ p₁₀₁₁ = p₁₀₁₁ ⊕ λ₀ p₁₂₁₈ = p₁₂₁₈ ⊕ λ₀ p₄₂₉₉ = p₄₂₉₉ ⊕ λ₀ p₇₁₄₃ = p₇₁₄₃ ⊕ λ₀ p₈₇₂₈ = p₈₇₂₈ ⊕ λ₀ p₁₁₀₇₂ = p₁₁₀₇₂ ⊕ λ₀ p₁₅₅₃₃ = p₁₅₅₃₃ ⊕ λ₀ p₁₇₃₅₆ = p₁₇₃₅₆ ⊕ λ₀ p₃₃₉₀₉ = p₃₃₉₀₉ ⊕ λ₀ p₃₆₈₃₃ = p₃₆₈₃₃ ⊕ λ₀

where the addition ⊕ occurs in GF(2).

The subsequent L−1 information bits, that is, λ_(m), m=1,2, . . . , L−1, are accumulated at parity bit addresses that are calculated by the following Equation 5:

(x+m×Q ₁) mod M ₁ if x<M ₁

M ₁+{(x−M ₁ +m×Q ₂) mod M ₂} if x≥M ₁   (5)

where x denotes the addresses of parity bits corresponding to the first information bit λ₀, that is, the addresses of the parity bits specified in the first row of the sequence of the Sequence Table, Q₁=M₁/L, Q₂=M₂/L, and L=360. Furthermore, Q₁ and Q₂ are defined in the following Table 2. For example, for an LDPC code having a length of 64800 and a code rate of 5/15, M₁=1440, Q₁=4, M₂=41760, Q₂=116 and L=360, and the following operations are performed on the second bit λ₁ using Equation 5:

p₂₂₅ = p₂₂₅ ⊕ λ₁ p₁₀₁₅ = p₁₀₁₅ ⊕ λ₁ p₁₂₂₂ = p₁₂₂₂ ⊕ λ₁ p₄₄₁₅ = p₄₄₁₅ ⊕ λ₁ p₇₂₅₉ = p₇₂₅₉ ⊕ λ₁ p₈₈₄₄ = p₈₈₄₄ ⊕ λ₁ p₁₁₁₈₈ = p₁₁₁₈₈ ⊕ λ₁ p₁₅₆₄₉ = p₁₅₆₄₉ ⊕ λ₁ p₁₇₄₇₂ = p₁₇₄₇₂ ⊕ λ₁ p₃₄₀₂₅ = p₃₄₀₂₅ ⊕ λ₁ p₃₆₉₄₉ = p₃₆₉₄₉ ⊕ λ₁

Table 2 illustrates the sizes of M₁, Q₁, M₂ and Q₂ of the designed QC-LDPC code:

TABLE 2 Sizes Code rate Length M₁ M₂ Q₁ Q₂ 5/15 64800 1440 41760 4 116

The addresses of parity bit accumulators for new 360 information bits from λ_(L) to λ_(2L−1) are calculated and accumulated from Equation 5 using the second row of the sequence.

In a similar manner, for all groups composed of new L information bits, the addresses of parity bit accumulators are calculated and accumulated from Equation 5 using new rows of the sequence.

After all the information bits from λ₀ to λ_(K−1) have been exhausted, the operations of the following Equation 6 are sequentially performed from i=1:

p _(i) =p _(i) ⊕ p _(i−1) for i=0,1, . . . , M₁−1   (6)

Thereafter, when a parity interleaving operation, such as that of the following Equation 7, is performed, parity bits corresponding to the dual diagonal matrix B are generated:

λ_(K+L·t+s) =p _(Q) ₁ _(·s+t) for 0≤s<L, 0≤t<Q ₁   (7)

When the parity bits corresponding to the dual diagonal matrix B have been generated using K information bits λ₀, λ₁, . . . , λ_(K−1), parity bits corresponding to the identity matrix D are generated using the M₁ generated parity bits λ_(K), λ_(K+1), . . . , λ_(K+M) ₁ ⁻¹.

For all groups composed of L information bits from λ_(K) to λ_(K+M) ₁ ⁻¹, the addresses of parity bit accumulators are calculated using the new rows (starting with a row immediately subsequent to the last row used when the parity bits corresponding to the dual diagonal matrix B have been generated) of the sequence and Equation 5, and related operations are performed.

When a parity interleaving operation, such as that of the following Equation 8, is performed after all the information bits from λ_(K) to λ_(K+M) ₁ ⁻¹ have been exhausted, parity bits corresponding to the identity matrix D are generated:

λ_(K+M) ₁ _(+L·t+s) =p _(M) ₁ _(+Q) ₂ _(·s+t) for 0≤s<L, 0≤t<Q ₂   (8)

FIG. 4 is a diagram illustrating the bit groups of an LDPC codeword having a length of 64800.

Referring to FIG. 4, it can be seen that an LDPC codeword having a length of 64800 is divided into 180 bit groups (a 0th group to a 179th group).

In this case, 360 may be the parallel factor (PF) of the LDPC codeword. That is, since the PF is 360, the LDPC codeword having a length of 64800 is divided into 180 bit groups, as illustrated in FIG. 4, and each of the bit groups includes 360 bits.

FIG. 5 is a diagram illustrating the bit groups of an LDPC codeword having a length of 16200.

Referring to FIG. 5, it can be seen that an LDPC codeword having a length of 16200 is divided into 45 bit groups (a 0th group to a 44th group).

In this case, 360 may be the parallel factor (PF) of the LDPC codeword. That is, since the PF is 360, the LDPC codeword having a length of 16200 is divided into 45 bit groups, as illustrated in FIG. 5, and each of the bit groups includes 360 bits.

FIG. 6 is a diagram illustrating interleaving that is performed on a bit group basis in accordance with an interleaving sequence.

Referring to FIG. 6, it can be seen that interleaving is performed by changing the order of bit groups by a designed interleaving sequence.

For example, it is assumed that an interleaving sequence for an LDPC codeword having a length of 16200 is as follows:

interleaving sequence={24 34 15 11 2 28 17 25 5 38 19 13 6 39 1 14 33 37 29 12 42 31 30 32 36 40 26 35 44 4 16 8 20 43 21 7 0 18 23 3 10 41 9 27 22}

Then, the order of the bit groups of the LDPC codeword illustrated in FIG. 4 is changed into that illustrated in FIG. 6 by the interleaving sequence.

That is, it can be seen that each of the LDPC codeword 610 and the interleaved codeword 620 includes 45 bit groups, and it can be also seen that, by the interleaving sequence, the 24th bit group of the LDPC codeword 610 is changed into the 0th bit group of the interleaved LDPC codeword 620, the 34th bit group of the LDPC codeword 610 is changed into the 1st bit group of the interleaved LDPC codeword 620, the 15th bit group of the LDPC codeword 610 is changed into the 2nd bit group of the interleaved LDPC codeword 620, and the 11st bit group of the LDPC codeword 610 is changed into the 3rd bit group of the interleaved LDPC codeword 620, and the 2nd bit group of the LDPC codeword 610 is changed into the 4th bit group of the interleaved LDPC codeword 620.

An LDPC codeword (u₀, u₁, . . . , u_(N) _(ldpc) ⁻¹) having a length of N_(ldpc) is divided into N_(group)=N_(ldpc)/360 bit groups, as in Equation 9 below:

X _(j) ={u _(k)|360×j≤k<360×(j+1 ), 0≤k<N _(ldpc)} for 0≤j<N _(group)   (9)

where X_(j) is an j-th bit group, and each X_(j) is composed of 360 bits.

The LDPC codeword divided into the bit groups is interleaved, as in Equation 10 below:

Y _(j) =X _(π(j)) 0≤j≤N _(group)   (10)

where Y_(j) is an interleaved j-th bit group, and π(j) is a permutation order for bit group-based interleaving (bit group-unit interleaving). The permutation order corresponds to the interleaving sequence of Equation 11 below:

interleaving sequence={146 89 57 16 164 138 91 78 90 66 122 12 9 157 14 68 112 128 74 45 28 87 158 56 61 168 18 161 95 99 139 22 65 130 166 118 150 49 142 44 36 1 121 6 46 29 88 47 0 58 105 43 80 64 107 21 55 151 8 145 163 7 98 123 17 11 153 136 52 3 13 34 160 102 125 114 152 84 32 97 33 60 62 79 37 129 38 165 71 75 59 144 127 132 104 53 162 103 120 54 155 116 48 77 76 73 113 119 179 177 41 19 92 109 31 143 178 108 39 140 106 40 5 25 81 176 101 124 126 72 111 4 173 156 134 86 174 2 170 35 175 137 15 24 69 96 30 117 67 171 149 169 63 23 20 167 27 147 51 10 82 131 85 110 94 135 172 148 50 154 42 70 115 26 83 141 100 133 93 159}  (11)

That is, when each of the codeword and the interleaved codeword includes 180 bit groups ranging from a 0th bit group to a 179th bit group, the interleaving sequence of Equation 11 means that the 146th bit group of the codeword becomes the 0th bit group of the interleaved codeword, the 89th bit group of the codeword becomes the 1st bit group of the interleaved codeword, the 57th bit group of the codeword becomes the 2nd bit group of the interleaved codeword, the 16th bit group of the codeword becomes the 3rd bit group of the interleaved codeword, . . . , the 93th bit group of the codeword becomes the 178th bit group of the interleaved codeword, and the 159th bit group of the codeword becomes the 179th bit group of the interleaved codeword.

In particular, the interleaving sequence of Equation 11 has been optimized for a case where 4096-symbol mapping (NUC symbol mapping) is employed and an LDPC coder having a length of 64800 and a code rate of 5/15 is used.

FIG. 7 is a block diagram illustrating a bit interleaver according to an embodiment of the present invention.

Referring to FIG. 7, the bit interleaver according to the present embodiment includes memories 710 and 730 and a processor 720.

The memory 710 stores an LDPC codeword having a length of 64800 and a code rate of 5/15.

The processor 720 generates an interleaved codeword by interleaving the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword.

In this case, the parallel factor may be 360. In this case, each of the bit groups may include 360 bits.

In this case, the LDPC codeword may be divided into 180 bit groups, as in Equation 9.

In this case, the interleaving may be performed using Equation 10 using permutation order.

In this case, the permutation order may correspond to the interleaving sequence represented by Equation 11.

The memory 730 provides the interleaved codeword to a modulator for 4096-symbol mapping.

In this case, the modulator may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping.

The memories 710 and 730 may correspond to various types of hardware for storing a set of bits, and may correspond to a data structure, such as an array, a list, a stack, a queue or the like.

In this case, the memories 710 and 730 may not be physically separate devices, but may correspond to different addresses of a physically single device. That is, the memories 710 and 730 are not physically distinguished from each other, but are merely logically distinguished from each other.

The error-correction coder 13 illustrated in FIG. 1 may be implemented in the same structure as in FIG. 7.

That is, the error-correction coder may include memories and a processor. In this case, the first memory is a memory that stores an LDPC codeword having a length of 64800 and a code rate of 5/15, and a second memory is a memory that is initialized to 0.

The memories may correspond to λ_(i)(i=0,1, . . . , N−1) and P_(j)(j=0, 1, . . . , M₁+M₂−1), respectively.

The processor may generate an LDPC codeword corresponding to information bits by performing accumulation with respect to the memory using a sequence corresponding to a parity check matrix (PCM).

In this case, the accumulation may be performed at parity bit addresses that are updated using the sequence of the above Sequence Table.

In this case, the LDPC codeword may include a systematic part λ₀, λ₁, . . . , λ_(K−1) corresponding to the information bits and having a length of 21600 (=K), a first parity part λ_(K), λ_(K+1), . . . , λ_(K+M) ₁ −1 corresponding to a dual diagonal matrix included in the PCM and having a length of 1440 (=M₁=g) and a second parity part λ_(K+M) ₁ , λ_(K+M) ₁ ₊₁, . . . , λ_(K+M) ₁ _(+M) ₂ ⁻¹ corresponding to an identity matrix included in the PCM and having a length of 41760 (=M₂).

In this case, the sequence may have a number of rows equal to the sum (21600/360+1440/360=64) of a value obtained by dividing the length of the systematic part, that is, 21600, by a CPM size L corresponding to the PCM, that is, 360, and a value obtained by dividing the length M₁ of the first parity part, that is, 1440, by 360.

As described above, the sequence may be represented by the above Sequence Table.

In this case, the second memory may have a size corresponding to the sum M₁+M₂ of the length M₁ of the first parity part and the length M₂ of the second parity part.

In this case, the parity bit addresses may be updated based on the results of comparing each x of the previous parity bit addresses, specified in respective rows of the sequence, with the length M₁ of the first parity part.

That is, the parity bit addresses may be updated using Equation 5. In this case, x may be the previous parity bit addresses, m may be an information bit index that is an integer larger than 0 and smaller than L, L may be the CPM size of the PCM, Q₁ may be M₁/L, M₁ may be the size of the first parity part, Q₂ may be M₂/L, and M₂ may be the size of the second parity part.

In this case, it may be possible to perform the accumulation while repeatedly changing the rows of the sequence by the CPM size L (=360) of the PCM, as described above.

In this case, the first parity part λ_(K), λ_(K+1), . . . , λ_(K+M) ₁ ⁻¹ may be generated by performing parity interleaving using the first memory and the second memory, as described in conjunction with Equation 7.

In this case, the second parity part λ_(K)+M₁, λ_(K+M) ₁ ₊₁, . . . , λ_(K+M) ₁ _(+M) ₂ ⁻¹ may be generated by performing parity interleaving using the first memory and the second memory after generating the first parity part λ_(K), λ_(K+1), λ_(K+M) ₁ ⁻¹ and then performing the accumulation using the first parity part λ_(K), λ_(K+1), . . . , λ_(K+M) ₁ ⁻¹ and the sequence, as described in conjunction with Equation 8.

FIG. 8 is an operation flowchart illustrating a bit interleaving method according to an embodiment of the present invention.

Referring to FIG. 8, in the bit interleaving method according to the present embodiment, an LDPC codeword having a length of 64800 and a code rate of 5/15 is stored at step S810.

In this case, the LDPC codeword may be represented by (u₀, u₁, . . . , u_(N) _(ldpc) ⁻¹) (where N_(ldpc) is 64800), and may be divided into 180 bit groups each composed of 360 bits, as in Equation 9.

Furthermore, in the bit interleaving method according to the present embodiment, an interleaved codeword is generated by interleaving the LDPC codeword on a bit group basis at step S820.

In this case, the size of the bit group may correspond to the parallel factor of the LDPC codeword.

In this case, the interleaving may be performed using Equation 10 using permutation order.

In this case, the permutation order may correspond to the interleaving sequence represented by Equation 11.

In this case, the parallel factor may be 360, and each of the bit groups may include 360 bits.

In this case, the LDPC codeword may be divided into 180 bit groups, as in Equation 9.

Moreover, in the bit interleaving method according to the present embodiment, the interleaved codeword is output to a modulator for 4096-symbol mapping at step 830.

In accordance with at least one embodiment of the present invention, there is provided an intra-BICM bit interleaver that can effectively distribute burst errors occurring in a broadcasting system channel.

In accordance with at least one embodiment of the present invention, there is provided a bit interleaver that is optimized for an LDPC coder having a length of 64800 and a code rate of 5/15 and a modulator performing 4096-symbol mapping and, thus, can be applied to next-generation broadcasting systems, such as ATSC 3.0.

Although the specific embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible without departing from the scope and spirit of the invention as disclosed in the accompanying claims. 

What is claimed is:
 1. A method of transmitting a broadcast signal, comprising: storing a low-density parity check (LDPC) codeword having a length of 64800 and a code rate of 5/15; generating an interleaved codeword by interleaving the LDPC codeword on a bit group basis, the size of the bit group corresponding to a parallel factor of the LDPC codeword; storing the interleaved codeword corresponding to 4096-symbol mapping, performing 4096-symbol mapping for generating a broadcast signal; and transmitting the broadcast signal over a physical channel, wherein the interleaving is performed using the following equation using permutation order: Y _(j) =X _(π(j)) 0≤j<N _(group) where X_(π(j)) is the π(j)th bit group, Y_(j) is an interleaved j-th bit group, and π(j) is a permutation order for bit group-based interleaving, wherein the permutation order corresponds to an interleaving sequence represented by the following interleaving sequence={146 89 57 16 164 138 91 78 90 66 122 12 9 157 14 68 112 128 74 45 28 87 158 56 61 168 18 161 95 99 139 22 65 130 166 118 150 49 142 44 36 1 121 6 46 29 88 47 0 58 105 43 80 64 107 21 55 151 8 145 163 7 98 123 17 11 153 136 52 3 13 34 160 102 125 114 152 84 32 97 33 60 62 79 37 129 38 165 71 75 59 144 127 132 104 53 162 103 120 54 155 116 48 77 76 73 113 119 179 177 41 19 92 109 31 143 178 108 39 140 106 40 5 25 81 176 101 124 126 72 111 4 173 156 134 86 174 2 170 35 175 137 15 24 69 96 30 117 67 171 149 169 63 23 20 167 27 147 51 10 82 131 85 110 94 135 172 148 50 154 42 70 115 26 83 141 100 133 93 159}, wherein the interleaved codeword is generated by the interleaving using the interleaving sequence on the bit group basis before performing the 4096-symbol mapping so as to distribute burst errors occurring in the transmission signal transmitted over the physical channel.
 2. The method of claim 1, wherein the 4096-symbol mapping is a Non-Uniform Constellation (NUC) symbol mapping which corresponds to 4096 constellations.
 3. The method of claim 2, wherein the parallel factor is 360, and the bit group includes 360 bits.
 4. The method of claim 3, wherein the LDPC codeword is represented by (u₀,u₁, . . . , u_(N) _(ldpc) ⁻¹) (where N_(ldpc) is 64800), and is divided into 180 bit groups each including 360 bits, as in the following equation: X _(j) ={u _(k)|360×j≤k<360×(j+1), 0≤k<N _(ldpc)} for 0≤j<N_(group) where X_(j) is an j-th bit group, N_(ldpc) is 64800, and N_(group) is
 180. 